Resolvable partially pairwise balanced designs and their applications in computer experiments ∗
نویسندگان
چکیده
The uniform design is one of major designs in computer experiments. In this paper, we develop the connection among the computer experiments, uniform designs in statistics and resolvable partially pairwise balanced designs (RPPBDs) from design theory. A series of RPPBDs with special requirements are constructed and used to produce new uniform designs under the discrete discrepancy.
منابع مشابه
Uniformly resolvable pairwise balanced designs with blocksizes two and three
A uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks can be resolved into parallel classes in such a way that all blocks in a given parallel class have the same size. We are concerned here with designs in which each block has size two or three, and we prove that the obvious necessary conditions on the existence of such designs are also sufficient, with two ...
متن کاملUse of Resolvable Designs in Field and on Farm Experiments
1. Introduction Resolvable designs, though introduced in the combinatorial context, have found their utility in field experiments. The concept of resolvability is due to Bose (1942) who defined this for a balanced incomplete block (BIB) design. A BIB design is an arrangement of v treatments into b blocks such that each block contains k (< v) distinct treatments, each treatment appears in r bloc...
متن کاملConstructing some PBIBD(2)s by Tabu Search Algorithm
Some papers have dealt with the construction of 2-concurrence designs as an optimization problem. In this paper we generalize these results to formulate also the construction of partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We will propose an algorithm based on tabu search to construct many of these designs. Our algorithm was able ...
متن کاملOn vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained in exactly one subspace in P. A uniformly resolvable design is a pairwise balanced design whose blocks can be resolved in such a way that all blocks in a given parallel class have the same size. A partition of Vn(q) co...
متن کاملA Method for Classification of Doubly Resolvable Designs and Its Application
The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property—they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications. Therefore the classification of doubly resol...
متن کامل